Interpolation in list decoding of Reed-Solomon codes
نویسنده
چکیده
The problem of efficient implementation of two-dimensional interpolation in the Guruswami-Sudan list decoding algorithm for Reed-Solomon codes is considered. It is shown that it can be implemented by computing the product of the ideals of interpolation polynomials constructed for subsets of interpolation points. A method for fast multiplication of zero-dimensional co-prime ideals product is proposed. DOI: 10.1134/S003294600703????
منابع مشابه
An Interpolation Algorithm for List Decoding of Reed-Solomon Codes
The interpolation step of Sudan’s list decoding of Reed-Solomon codes sets forth the problem of finding the minimal polynomial of the ideal of interpolating polynomials with respect to a certain monomial order. An efficient algorithm that solves the problem is presented based on the theory of Gröbner bases of modules. In a special case, this algorithm is shown to be equivalent with the Berlekam...
متن کاملRetrieving Reed-Solomon coded data under interpolation-based list decoding
A transform that enables generator-matrix-based Reed-Solomon (RS) coded data to be recovered under interpolation-based list decoding is presented. The transform matrix needs to be computed only once and the transformation of an element from the output list to the desired RS coded data block incurs k field multiplications, given a code of dimension k. Index Terms Galois Field Fourier Transform, ...
متن کاملEfficient Interpolation Architecture for Soft-Decision List Decoding of Reed- Solomon Codes
Recently, algebraic soft-decision decoding algorithm for RS codes that can correct the errors beyond the error correcting bound has been proposed. The main task in the algorithm is the weighted interpolation of a bivariate polynomial that requires intensive computations. In this paper, we propose an efficient architecture with low hardware complexity for interpolation in soft-decision list deco...
متن کاملAlgebraic List Decoding of Reed-Solomon product codes
The product code of two Reed-Solomon codes can be regarded as an evaluation codes of bivariate polynomials, whose degrees in each variable are bounded. We propose to decode these codes with a generalization of the Guruswami-Sudan interpolation-based list decoding algorithm. A relative decoding radius of 1 − 6 √4R is found, where is the rate of the product code. We also discuss a generalization ...
متن کاملSudan’s List Decoding of Reed-Solomon Codes from a Gröbner Basis Perspective
The interpolation step of Sudan’s list decoding of Reed-Solomon codes sets forth the problem of finding the minimal polynomial of an ideal with respect to a certain monomial order. An efficient algorithm that solves the problem is presented based on the theory of Gröbner bases of modules. In a special case, this algorithm is shown to be equivalent with the Berlekamp-Massey algorithm for decodin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Probl. Inf. Transm.
دوره 43 شماره
صفحات -
تاریخ انتشار 2007